Right quadruple convexity

On Convexity of Right-Closed Integral Sets

Let N denote the set of non-negative integers. A set of non-negative, n-dimensional integral vectors, M ⊂ N, is said to be right-closed, if ((x ∈ M) ∧ (y ≥ x) ∧ (y ∈ N)) ⇒ (y ∈ M). In this paper, we present a polynomial time algorithm for testing the convexity of a right-closed set of integral vectors, when the dimension n is fixed. Right-closed set of integral vectors are infinitely large, by ...

Near convexity, metric convexity, and convexity

It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...

JPEG : the quadruple object

The thesis, together with its practice-research works, presents an objectoriented perspective on the JPEG standard. Using the object-oriented philosophy of Graham Harman as a theoretical and also practical starting point, the thesis looks to provide an account of the JPEG digital object and its enfolding within the governmental scopic regime. The thesis looks to move beyond accounts of digital ...

Projective Convexity in P Implies Grassmann Convexity

In this note we introduce the notion of Grassmann convexity analogous to the wellknown notion of convexity for curves in real projective spaces. We show that the curve in G2,4 osculating to a convex closed curve in P is Grassmann-convex. This proves that the tangent developable (i.e. the hypersurface formed by all tangents) of any convex curve in P has the ‘degree’ equal to 4. Here by ‘degree’ ...

Quadruple Time Redundancy Adders